Aeolus: A Markov–Chain Monte Carlo code for mapping
ثبت نشده
چکیده
Deducing the cloud cover and its temporal evolution from the observed planetary spectra and phase curves can give us major insight into the atmospheric dynamics. In this paper, we present Aeolus, a Markov–Chain Monte Carlo code that maps the structure of brown dwarf and other ultracool atmospheres. We validated Aeolus on a set of unique Jupiter Hubble Space Telescope (HST) light curves. Aeolus accurately retrieves the properties of the major features of the jovian atmosphere such as the Great Red Spot and a major 5μm hot spot. Aeolus is the first mapping code validated on actual observations of a giant planet over a full rotational period. For this study, we applied Aeolus to J and H–bands HST light curves of 2MASSJ21392676+0220226 and 2MASSJ0136565+093347. Aeolus retrieves three spots at the top–of–the–atmosphere (per observational wavelength) of these two brown dwarfs, with a surface coverage of 21%±3% and 20.3%±1.5% respectively. The Jupiter HST light curves will be publicly available via ADS/VIZIR. Subject headings: methods: statistical techniques: photometric planets and satellites:Jupiter 2MASSJ21392676+0220226 -2MASSJ0136565+093347
منابع مشابه
Aeolus: a Markov Chain Monte Carlo Code for Mapping Ultracool Atmospheres. an Application on Jupiter and Brown Dwarf Hst Light Curves
Deducing the cloud cover and its temporal evolution from the observed planetary spectra and phase curves can give us major insight into the atmospheric dynamics. In this paper, we present Aeolus, a Markovchain Monte Carlo code that maps the structure of brown dwarf and other ultracool atmospheres. We validated Aeolus on a set of unique Jupiter Hubble Space Telescope (HST) light curves. Aeolus ...
متن کاملA Markov-Chain Monte Carlo Approach to Simultaneous Localization and Mapping
A Markov-chain Monte Carlo based algorithm is provided to solve the Simultaneous localization and mapping (SLAM) problem with general dynamics and observation model under open-loop control and provided that the map-representation is finite dimensional. To our knowledge this is the first provably consistent yet (close-to) practical solution to this problem. The superiority of our algorithm over ...
متن کاملAutomatic Recognition and Location of Civil Infrastructure Objects Using Mobile Mapping Technology, Neural Network and Markov Chain Monte Carlo
متن کامل
A Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind
In the present work, a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind. The solution of the integral equation is described by the Neumann series expansion. Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method. An algorithm is proposed to sim...
متن کامل